package com.example.algorithm.service;

/**
 * @author Administrator
 * @date 2024/8/14 19:03
 * @description 多维动态规划
 */
public interface MultiDimensionDynamicPlanService {

    public int uniquePaths(int m, int n);

    public int minPathSum(int[][] grid);

    public String longestPalindrome(String s);

    public int longestCommonSubsequence(String text1, String text2);

    public int minDistance(String word1, String word2);
}
